package LeetCode.interview;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;

import LeetCode.interview._104_Maximum_Depth_of_Binary_Tree.TreeNode;

import sun.tools.jar.resources.jar;
import util.LogUtils;

/*
 * 
原题　
		Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
	
	(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
	
	You are given a target value to search. If found in the array return its index, otherwise return -1.
	
	You may assume no duplicate exists in the array.

题目大意

解题思路
	http://www.cnblogs.com/springfor/p/3858140.html
 * @Date 2017-09-14 23：43
 */
public class _033_Search_in_Rotated_Sorted_Array {
	
	public int search(int [] A, int target){
		return 0;
	}
    
	public static void main(String[] args) {
		_033_Search_in_Rotated_Sorted_Array obj = new _033_Search_in_Rotated_Sorted_Array();
//		obj.twoSum(new int[]{1, 2, 3, 4, 5, 6, 7}, 7);
//		obj.twoSum2(new int[]{2, 7, 11, 15}, 9);
		obj.search(new int[]{3, 2, 4}, 6);
	}

}
